Signature-based structures for objects with set-valued attributes
نویسندگان
چکیده
Aiming at the efficient retrieval of objects with set-valued attributes, we introduce three variations of a new method in order to satisfy subset and superset queries. Our approach is to combine the advantages of two access methods, that of linear Hashing and of tree-shaped methods, on which other similar methods have been previously reported as well. Performance estimation analytical functions for each particular method are presented, followed by a thorough experimental comparison of all investigated structures, where analytical and experimental results deviate 10% on the average. Finally, the results of this performance evaluation are presented and discussed, clearly showing the superiority of the new methods reaching an improvement of up to 85%. r 2002 Published by Elsevier Science Ltd.
منابع مشابه
Index Structures for Databases Containing Data Items with Set-valued Attributes Index Structures for Databases Containing Data Items with Set-valued Attributes
We introduce two new hash-based index structures to index set-valued attributes. Both are able to support subset and superset queries. Analytical cost models for the new index structures as well as for the two existing index structures, sequential signature le and Russian Doll Tree, are presented and experimentally validated. Using the validated cost model, we express the performance of all fou...
متن کاملA Study of Four Index Structuresfor Set - Valued
We review and study the performance of four diierent index structures for indexing set-valued attributes designed to speed up set equality, subset and superset queries. All index structures are based on traditional techniques, namely signatures and inverted les. More speciically, we consider sequential signature les, signature trees, extendible signature hashing, and a B-tree based implementati...
متن کاملHierarchical Bitmap Index: An Efficient and Scalable Indexing Technique for Set-Valued Attributes
Set-valued attributes are convenient to model complex objects occurring in the real world. Currently available database systems support the storage of set-valued attributes in relational tables but contain no primitives to query them efficiently. Queries involving set-valued attributes either perform full scans of the source data or make multiple passes over single-value indexes to reduce the n...
متن کاملThe categories of lattice-valued maps, equalities, free objects, and $mathcal C$-reticulation
In this paper, we study the concept of $mathcal C$-reticulation for the category $mathcal C$ whose objects are lattice-valued maps. The relation between the free objects in $mathcal C$ and the $mathcal C$-reticulation of rings and modules is discussed. Also, a method to construct $mathcal C$-reticulation is presented, in the case where $mathcal C$ is equational. Some relations between the conce...
متن کاملAn Indexing Method for Handling Queries on Set-Valued Attributes in Object-Oriented Databases
We propose a signature-based indexing method for object-oriented query handling in this paper. Signature file based access methods initially applied on text for their filtering capability have now been used to handle set-oriented queries in Object-Oriented Data Bases (OODBs). All the proposed techniques use either search methods that take longer retrieval time or tree based intermediate data st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Syst.
دوره 27 شماره
صفحات -
تاریخ انتشار 2002